On totally multiplicative signatures of natural numbers
نویسندگان
چکیده
منابع مشابه
On Fields of Totally S-adic Numbers
Given a finite set S of places of a number field, we prove that the field of totally S-adic algebraic numbers is not Hilbertian. The field of totally real algebraic numbers Qtr, the field of totally p-adic algebraic numbers Qtot,p, and, more generally, fields of totally S-adic algebraic numbers Qtot,S, where S is a finite set of places of Q, play an important role in number theory and Galois th...
متن کاملOn Axiomatizability of the Multiplicative Theory of Numbers
The multiplicative theory of a set of numbers is the theory of the structure of that set with (solely) the multiplication operation (that set is taken to be multiplicative, i.e., closed under multiplication). In this paper we study the multiplicative theories of the complex, real and (positive) rational numbers. These theories are known to be decidable; here we present some explicit axiomatizat...
متن کاملSimplicial Complexes Associated to Certain Subsets of Natural Numbers and Its Applications to Multiplicative Functions
We call a set of positive integers closed under taking unitary divisors an unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial complex with the property that the value on a face is the product of the values at the vertices of that face. We use this observation to solve the following...
متن کاملOn the Fermat Periods of Natural Numbers
Let b > 1 be a natural number and n ∈ N0. Then the numbers Fb,n := b 2 +1 form the sequence of generalized Fermat numbers in base b. It is well-known that for any natural number N , the congruential sequence (Fb,n (mod N)) is ultimately periodic. We give criteria to determine the length of this Fermat period and show that for any natural number L and any b > 1 the number of primes having a peri...
متن کاملNatural Numbers
In this article we present several logical schemes. The scheme NonUniqRecExD deals with a non empty set A, an element B of A, and a ternary predicate P, and states that: There exists a function f from N into A such that f(0) = B and for every element n of N holds P[n, f(n), f(n + 1)] provided the following condition is satisfied: • For every natural number n and for every element x of A there e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1984
ISSN: 0386-2194
DOI: 10.3792/pjaa.60.273